Authenticated Encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated Authenticated Encryption schemes, Artemia. It is an online nonce-based Authenticated Encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the inverse of the permutation in the decryption function, which causes the resource efficiency. Artemia permutations have an efficient and a simple structure and are provably secure against the differential and linear cryptanalysis. In the permutations, MDS recursive layers are used that can be easily implemented in both software and hardware.

CAESAR competition is a competition for the design of cryptographic Authenticated Encryption schemes with associated data (AEAD). NORX is one of the CEASAR candidates which has been selected for the second round of this completion also. In this paper, the first linear cryptanalysis of this scheme is presented using mixed integer linear programming (MILP). The analysis conducted in this paper has been done for the reduced round NORX8, NORX16, NORX32 and NORX64. Our best linear characteristics for these variants reduced to one round out of four rounds have biases 2-52, 2-47, 2-21 and 2-76 respectively. Due to the optimized answer for NORX8, this version of reduced NORX provides optimal security against linear attack.

Search protocols are among the main applications of RFID systems. Since a search protocol should be able to locate a certain tag among many tags, not only it should be secure against RFID threats but also it should be affordable. In this article, an RFID-based search protocol will be presented. We use an Encryption technique that is referred to as Authenticated Encryption in order to boost the security level, which can provide confidentiality and integrity, simultaneously. Furthermore, since the proposed protocol belongs to the lightweight protocols category, it is appropriate for applications that require many tags and costs must be low. In terms of the security, the analysis results give a satisfactory security level and it is robust against different RFID threats like replay, traceability and impersonation attacks. Using Ouafi-Phan model, BAN and AVISPA, we also checked the security correctness of the suggested protocol.

Authenticated Encryption (AE) schemes provide both privacy and integrity of data. CAESAR is a competition to design and analysis of the AE schemes. An AE scheme has two components: a mode of operation and a primitive. In this paper JHAE, a novel Authenticated Encryption mode, is presented based on the JH (SHA-3 finalist) hash mode. JHAE is an on-line and single-pass dedicated AE mode based on permutation that supports optional associated data (AD). It is proved that this mode, based on ideal permutation, achieves privacy and integrity up to O (2n=2) queries where the length of the used permutation is 2n. To decrypt, JHAE does not require the inverse of its underlying permutation and therefore saves area space. JHAE has been used by Artemia, one of the CAESAR's first round candidates.

Recently, the approach of outsourcing database and infrastructure transfer in cloud computing has received a lot of attention from organizations and users. Database owners are trusted by service providers and infrastructure providers in terms of maintainability and accessibility, but are concerned about the confidentiality of information. Therefore, they encrypt the database on cloud servers. The main challenge is to search and retrieve the encrypted database. Although existing searchable Encryption schemes allow the user to search and retrieve encrypted data with high reliability, most of these solutions cannot verify the search result. Because the cloud server may only perform part of the search to maintain computing capability or save bandwidth, it may not provide the user with complete and accurate search results. Various searchable Encryption schemes that verify and confirm the return results are presented. These schemes usually use a separate method in addition to the algorithms required for confidentiality that increase the processing volume. In this paper, we present a clustered fuzzy keyword search scheme validated on the encrypted database that encrypts and verifies its results using the Authenticated Encryption method. In addition to reducing the volume of stored metadata, reducing the computational burden and increasing the speed of fuzzy search, the proposed scheme acknowledges the return results of the cloud server and is also effective in reducing costs. The proposed plan is safe against the threats considered and retrieves the results correctly and efficiently.

Authenticated Encryption schemes provide both confidentiality and integrity services, simultaneously. The CAESAR competition is being held with the aim of designing this cipher. An important criterion for selecting the final portfolio, besides security, is the hardware performance of the candidate in the environments with limited resource. In this paper, for the first time for COLM Authenticated ciphers from the final round of the CAESAR, an 8-bit lightweight architecture have been presented, which is compatible with API v2. Since COLM scheme uses AES cipher as a primitive, lightweight architecture of Atomic-AES has been selected and adopted according to the API rules. Furthermore, to reduce the area in the hardware implementation, several techniques are used, including implementing one AES core in the datapath, sharing of registers and implementation doubling on the GF (2128) with 8-bit architecture for constructing the higher-order multipliers. Proposed architecture of COLM is implemented on ASIC and FPGA platforms. This architecture is similar in both platforms, but different technology mapping optimization techniques are used for each platform. Comparing the results with 128-bit implementations shows that the area on FPGA and ASIC is reduced by 62% and 74%, respectively. Also, the customized API v2 for 8-bit data width reduced the API area by 8% and 6% on the FPGA and ASIC platforms, respectively.

Group key exchange protocols play main role in group applications such as computer networks, telecommunication and military systems. Given the wide range of usage of group applications, research and design of these protocols can play an important role in securing international exchanges, trade and military issues. Most existing group key exchange protocols establish multi-party or group key exchange protocols based on extending the two party well known Diffie-Hellman key exchanges. The security of these protocols is based on this assumption that difficulty of solving group Diffie-Hellman problem can be reduced to the difficulty of two party Diffie-Hellman problems. In spite of this assumption, Group key exchanges are not simply extension of two party protocols. In fact there are many differences and challenges that must be considered in design and implementation of these protocols. This difference is due to essential difference between peer to peer communication and group communication. In group communication in addition to considering the main goal e.g. obtaining group session key, consideration of group member changing is important too. In this paper, a Dynamic ID-based Group Key Agreement protocol based on Weil pairing is proposed. This complete ternary tree structure is used and dynamic changes in group are considered too. Finally we show that the proposed protocol is more efficient than other protocols with similar structure and also satisfies all known security requirements.

An image is a visual representation of something that has been created or copied and stored in electronic form. Securing images is becoming an important concern in today’s information security due to the extensive use of images that are either transmitted over a network or stored on disks. Since public media are unreliable and vulnerable to attacks, Image Encryption is the most effective way to fulfil confidentiality and protect the privacy of images over an unreliable public media.In this paper a new image Encryption algorithm based on Advanced Encryption Standard and DNA sequence is proposed. We present how to encode and decode data in a DNA sequence based on Codon replacement and how to perform the different steps of AES based DNA. The algorithm is implemented in MATLAB 2012b and various performance metrics are used to evaluate its efficacy. The theoretical and experimental analysis show that the proposed algorithm is efficient in speed and precision. Furthermore, the security analysis proves that proposed algorithm has a good resistance against the noise and known attacks; So that Unbreakability of proposed algorithm is 37.48% better than the compared algorithms.

AES - CMCCv1, AVALANCHEv1, CLOCv1, and SILCv1 are four candidates of the first round of CAESAR. CLOCv1 is presented in FSE 2014 and SILCv1 is designed upon it with the aim of optimizing the hardware implementation cost. In this paper, structural weaknesses of these candidates are studied. We present distinguishing attacks against AES - CMCCv1 with the complexity of two queries and the success probability of almost 1, and distinguishing attacks on CLOCv1 and SILCv1 with the complexity of O (2n/2) queries and the success probability of 0:63, in which n is bit length of message blocks. In addition, a forgery attack is presented against AVALANCHEv1 which requires only one query and has the success probability of 1. The attacks reveal weaknesses in the structure of these first round candidates and inaccuracy of their security claims.

Authenticated Encryption schemes provide both confidentiality and integrity services simultaneously. To design such schemes, the CAESAR competition was being held with six winners. One of the criteria for evaluation theses ciphers, besides general security, is the security against side-channel attacks, which has been studied less so far. The OCB Authenticated cipher, one of the CAESAR’ s winners, has special security properties such as a tweakable block cipher based construction that makes the side-channel attacks challenging. In this paper, for the first time, a 7-stage correlation power analysis (CPA) attack on nonce processing time is presented to indicate its vulnerability. For this purpose, OCB cipher is implemented on a SAKURA-G board. By measuring and collecting the power traces on S-box, a successful CPA attack with a zero-value power model is mounted and all bytes of the key are recovered.